Benchmark Problems for Oversubscribed Scheduling
نویسندگان
چکیده
When organizing a scheduling competition one important issue is identifying the test problems for which the participating teams should demonstrate the performance of their approach. Ideally, the results of a competitive evaluation of different approaches should be useful to both scheduling researchers and practitioners. To enable this, we believe that the process of producing problem instances for the competition should focus on two main issues: 1) generating benchmark problems that abstract features from real-world domains, while still providing guidance to solving problem instances from these domains and 2) choosing the real-world domain/domains to be representative for the type of challenges human schedulers are facing. The contribution of our paper is twofold. First, we propose problems with resource oversubscription as good candidates for the competition problems. Second, we present our approach to generating problems by merging the main common features of two similar real-world oversubscribed
منابع مشابه
Analyzing Basic Representation Choices in Oversubscribed Scheduling Problems
Both direct schedule representations as well as indirect permutation-based representations in conjunction with schedule builders are successfully employed in oversubscribed scheduling research. Recent work has indicated that in some domains, searching the space of permutations as opposed to the schedule space itself can be more productive in maximizing the number of scheduled tasks. On the othe...
متن کاملIncremental Management of Oversubscribed Vehicle Schedules in Dynamic Dial-A-Ride Problems
In this paper, we consider the problem of feasibly integrating new pick-up and delivery requests into existing vehicle itineraries in a dynamic, dial-a-ride problem (DARP) setting. Generalizing from previous work in oversubscribed task scheduling, we define a controlled iterative repair search procedure for finding an alternative set of vehicle itineraries in which the overall solution has been...
متن کاملResource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals expected to have the best worst case resource availability. Prior research in value and variable ordering heuristics for scheduling problems indicated that sophisticated, but more costly measures of resource contentio...
متن کاملUnderstanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips their availability and some subset of goals or tasks must be excluded. Two basic classes of techniques to solve oversubscribed scheduling problems have emerged: searching directly in the space of possible schedules an...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کامل